Run-length encodings (Corresp.)

نویسنده

  • Solomon W. Golomb
چکیده

explicitly evaluable functions. For example, the M-ary error probability is expressed as a quadrature in Lindsey's equation (17), PE(M) = 1 [I-2 lrn Qi(h, $;) exp (-g) dz] z/d eeL s m =22/;;moe-(1+d)s~41-'2@3(1, 1 + M, s, sL) d.s, (5) where, following Lindsey, h2/2 has been replaced by L to simplify the notation. From the series form of @3, it is obvious that the integral gives an additional double series numerator parameter: PE(M) = di eeL z ~1 (1 + d)-"-1'2 i (61 A complete set of recursion relations for F1 when one parameter at a time changes has been given by Le Vavasseur [S]. It is a simple matter to derive the necessary change for this two-parameter case but Le Vavasseur has included this as one of several examples, so that we have at once (8) (9)-I, e (a "-' a " '-'_ [eLP,(l)] = (1 + &)Y,(l), which is equivalent to a result of Price [9], who has derived a number of expressions for these and related integrals. Note that the derivation above is, thus far, much simpler and more straightforward than the admirably executed tours de force of previous derivations. However, the last step, viz., recognizing the form of the result, is automatically accomplished in the other derivations, and is much the harder part in the hypergeometric case. To obtain the reduction, we use operational relations [lo] to get The integral with the special parameters of (11) has been previously recognized as a Q function [12]-[14] so that the reduction is essentially complete.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the computation of rate-distortion functions (Corresp.)

compression techniques,” in 1970 Int. Conf. Communications, pp. 20.14-20.21. [6] T. J. Lynch, “Compression of weather charts by the segmented Lynch-Davisson code,” IEEE Trans. Commun. (Corresp.), vol. COM-21, pp. 774-776, June 1973. [7] H. Meyr et al., “Optimum run length codes,” in 1973 Znt. Co& Communications, pp. 48.1948.25. [8] W. S. Michel et al., “A coded facsimile system,” in IRE Weston ...

متن کامل

Encodings for High-Performance Energy-Efficient Signaling

Energy eÆciency, performance and signal integrity are conicting critical requirements for on-chip signaling. We propose a code-based solution that improves bit rate while reducing communication energy and preserving noise margins. Our technique is based on the observation that RC lines can be used at twice their limiting bit rate to transmit bit streams with no isolated bits. We propose new enc...

متن کامل

Palindromic rich words and run-length encodings

We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.

متن کامل

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings

Planning as satisfiability, as implemented in, for instance, the SATPLAN tool, is a highly competitive method for finding parallel step-optimal plans. A bottleneck in this approach is to prove the absence of plans of a certain length. Specifically, if the optimal plan has n steps, then it is typically very costly to prove that there is no plan of length n−1. We pursue the idea of leading this p...

متن کامل

Using sequence compression to speedup probabilistic profile matching

MOTIVATION Matching a biological sequence against a probabilistic pattern (or profile) is a common task in computational biology. A probabilistic profile, represented as a scoring matrix, is more suitable than a deterministic pattern to retain the peculiarities of a given segment of a family of biological sequences. Brute-force algorithms take O(NP) to match a sequence of N characters against a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1966